Nonempty intersection of longest paths in series–parallel graphs
نویسندگان
چکیده
منابع مشابه
Nonempty intersection of longest paths in series-parallel graphs
In 1966 Gallai asked whether all longest paths in a connected graph have nonempty intersection. This is not true in general and various counterexamples have been found. However, the answer to Gallai’s question is positive for several well-known classes of graphs, as for instance connected outerplanar graphs, connected split graphs, and 2-trees. A graph is series-parallel if it does not contain ...
متن کاملIntersection of Longest Paths in a Graph
In 1966, Gallai asked whether every connected graph has a vertex that is common to all its longest paths. The answer to this question is negative. We prove that the answer is positive for outerplanar graphs. Another related question was raised in 1995 at the British Combinatorial Conference: Do any three longest paths in a connected graph have a vertex in common? We prove that, in a connected g...
متن کاملLongest Paths in Circular Arc Graphs
We show that all maximum length paths in a connected circular arc graph have non–empty intersection.
متن کاملApproximating the longest paths in grid graphs
In this paper, we consider the problem of approximating the longest path in a grid graph that possesses a square-free 2-factor. By (1) analyzing several characteristics of four types of cross cells and (2) presenting three cycle-merging operations and one extension operation, we propose an algorithm that finds in an n-vertex grid graph G, a long path of length at least 6n + 2. Our approximation...
متن کاملLongest Paths in Series-Parallel Graphs
In 1966 Gallai asked whether all longest paths in a connected graph intersect in a common vertex. This is not true in general and various counterexamples have been found. However, many well-known classes of graphs have the socalled Gallai property, e.g. trees and outerplanar graphs. Recently, de Rezende et al. proved that 2-trees, which are maximal series-parallel graphs, also have this propert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.07.023